Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
741	A Simple Public-Key Cryptosystem with a Double Trapdoor Decryption Mechanism and its Applications Emmanuel Bresson1 , Dario Catalano2 , and David Pointcheval2 1 Add to Reading List Source URL: www.iacr.org Language: English - Date: 2008-09-15 00:54:54 Finite fields Electronic commerce Paillier cryptosystem Okamoto–Uchiyama cryptosystem Goldwasser–Micali cryptosystem XTR ElGamal encryption Diffie–Hellman problem RSA Cryptography Public-key cryptography Computational hardness assumptions
742	Hindawi Publishing Corporation Advances in Mathematical Physics Volume 2013, Article ID[removed], 14 pages http://dx.doi.org[removed][removed]Research Article Add to Reading List Source URL: downloads.hindawi.com Language: English - Date: 2014-08-28 16:08:54 Fluid mechanics Fluid dynamics Hyperbolic partial differential equations Riemann problem Rankine–Hugoniot conditions Shock wave Dirac delta function Integral Sod shock tube Mathematical analysis Computational fluid dynamics Dynamics
743	Boneh et al.’s k-Element Aggregate Extraction Assumption Is Equivalent to The Diffie-Hellman Assumption Jean-Sebastien Coron and David Naccache Gemplus Card International 34, rue Guynemer, Issy-les-Moulineaux, F-92447, Add to Reading List Source URL: www.iacr.org Language: English - Date: 2008-09-15 00:54:54 Public-key cryptography Computational hardness assumptions BLS Diffie–Hellman problem Digital signature XTR Parity of a permutation Diffie–Hellman key exchange Structure Cryptography Finite fields Cryptographic protocols
744	MAPREDUCE FOR INTEGER FACTORIZATION arXiv:1001.0421v1 [cs.DC] 4 Jan 2010 JAVIER TORDABLE Abstract. Integer factorization is a very hard computational problem. Currently no efficient algorithm for integer factorization i Add to Reading List Source URL: arxiv.org Language: English - Date: 2010-01-03 19:17:14 Number theory Quadratic sieve General number field sieve MapReduce Integer factorization Quadratic residue Factor base Factorization RSA Integer factorization algorithms Cryptography Mathematics
745	New Admissible Heuristics for Domain-Independent Planning Patrik Haslum Blai Bonet H´ector Geffner Add to Reading List Source URL: www.ida.liu.se Language: English - Date: 2012-02-01 04:56:30 Computational complexity theory Heuristic function Admissible heuristic Heuristic Automated planning and scheduling Mathematical optimization Fifteen puzzle Shortest path problem Scheduling Heuristics Mathematics Theoretical computer science
746	Computational Intelligence, Volume 16, Number 2, 2000 TACKLING THE QUALIFICATION PROBLEM USING FLUENT DEPENDENCY CONSTRAINTS JONAS KVARNSTROM ¨ Add to Reading List Source URL: www.ida.liu.se Language: English - Date: 2012-02-03 06:46:26 Artificial intelligence Knowledge Science Logic in computer science Frame problem Situation calculus Ramification problem Fluent Reason Logic programming Knowledge representation Epistemology
747	HS-ETS1-4 Students who demonstrate understanding can: HS-ETS1-4. Use a computer simulation to model the impact of proposed solutions to a complex real-world problem with numerous criteria and constraints on interactions Add to Reading List Source URL: www.nextgenscience.org Language: English - Date: 2015-01-06 08:35:59 Models of computation Ethology Operations research Simulation Computer simulation Knowledge Economic model Scientific modelling Computational model Scientific modeling Science Computational science
748	Integrated Information Theory of Consciousness Neil Bramley Plan I Neil (~25 minutes): Add to Reading List Source URL: www.ucl.ac.uk Language: English - Date: 2014-12-03 08:43:24 Cognition Functionalism Mind–body problem Philosophy of artificial intelligence Computational theory of mind Consciousness Hard problem of consciousness Structural functionalism Multiple realizability Philosophy of mind Cognitive science Mind
749	On the concrete hardness of Learning with Errors Martin R. Albrecht1 , Rachel Player1 , and Sam Scott1 Information Security Group, Royal Holloway, University of London Abstract. The Learning with Errors (LWE) problem has Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-01-19 12:06:15 Lattice points Computational number theory Abstract algebra Lattice problem Lattice reduction Lenstra–Lenstra–Lovász lattice basis reduction algorithm Learning with errors Lattice Projection Mathematics Cryptography Algebra
750	Non-Abelian Analogs of Lattice Rounding Evgeni Begelfor Department of Computer Science The Hebrew University of Jerusalem [removed] Stephen D. Miller∗ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-01-11 23:40:13 Lattice points Computational number theory Matrix theory Abstract algebra Lattice problem Lattice Lenstra–Lenstra–Lovász lattice basis reduction algorithm Vector space Matrix Algebra Mathematics Linear algebra

UPDATE